| 翻訳と辞書 |
| Widening (computer science) ： ウィキペディア英語版 |
Widening (computer science)
In computer science, especially model checking and abstract interpretation, widening refers to at least two different techniques in the analysis of abstract transition systems where infinite progressions of abstract states are replaced by a (computed or guessed〔Ahmed Bouajjani and Tayssir Touili (2012), "Widening techniques for regular tree model checking", ''STTT'', Vol. 14, No. 2, pp. 145 -- 165 ()〕) least fixed point. The use of the term in ''model checking'' is closely related to ''acceleration'' techniques, some authors reserving ''acceleration'' for exact computations.〔Sébastien Bardin, Alain Finkel, Jérôme Leroux and Philippe Schnoebelen, ''Flat acceleration in symbolic model checking'' (2005), Automated Technology for Verification and Analysis, pp. 474--488, Springer〕
== Intuition ==
While many computer programs can be understood in terms of machine states and transitions (see formal semantics of programming languages), their state spaces may be too large to fully represent and analyse. Modern analysis techniques therefore try to reason about abstract states, which correspond to many concrete states.
Often, the abstract states are structured in such a way that by repeatedly following the effect of program steps or by coarsening the abstraction, one obtains a chain of abstractions that is proven to terminate.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Widening (computer science)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|